A simple algebraic approximation to the Erlang loss system
نویسنده
چکیده
We use Palm calculus to derive a simple, intuitive system of two linear-quadratic equations and two unknowns, whose algebraic solution yields Harel’s (1988) upper bound to the Erlang loss probability. We then derive a sequence of progressively stronger systems of equations, which eventually become exact. We provide two example applications.
منابع مشابه
Cold standby redundancy optimization for nonrepairable series-parallel systems: Erlang time to failure distribution
In modeling a cold standby redundancy allocation problem (RAP) with imperfect switching mechanism, deriving a closed form version of a system reliability is too difficult. A convenient lower bound on system reliability is proposed and this approximation is widely used as a part of objective function for a system reliability maximization problem in the literature. Considering this lower bound do...
متن کاملDegenerate kernel approximation method for solving Hammerstein system of Fredholm integral equations of the second kind
Degenerate kernel approximation method is generalized to solve Hammerstein system of Fredholm integral equations of the second kind. This method approximates the system of integral equations by constructing degenerate kernel approximations and then the problem is reduced to the solution of a system of algebraic equations. Convergence analysis is investigated and on some test problems, the propo...
متن کاملNonstationary Erlang Loss Queues and Networks
ALNOWIBET, KHALID ABDULAZIZ Nonstationary Erlang Loss Queues and Networks. (Under the direction of Dr. Harry Perros) The nonstationary Erlang loss model is a queueing system consisting of a finite number of servers and no waiting room with a nonstationary arrival process or a time-dependent service rate. The Erlang loss model is commonly used to model and evaluate many communication systems. Of...
متن کاملProvisioning for Bandwidth Sharing and Exchange
Customers of bandwidth services can be divided into two distinct groups: those customers requesting bandwidth for the future and those desiring bandwidth immediately. We develop a dynamic network provisioning methodology that minimally satis es the QoS (blocking probability) requirements for the 'on-demand' customers. Our method is suf ciently general and captures time varying trends in the dem...
متن کاملAn improved pseudospectral approximation of generalized Burger-Huxley and Fitzhugh-Nagumo equations
In this research paper, an improved Chebyshev-Gauss-Lobatto pseudospectral approximation of nonlinear Burger-Huxley and Fitzhugh- Nagumo equations have been presented. The method employs chebyshev Gauss-Labatto points in time and space to obtain spectral accuracy. The mapping has introduced and transformed the initial-boundary value non-homogeneous problem to homogeneous problem. The main probl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Oper. Res. Lett.
دوره 36 شماره
صفحات -
تاریخ انتشار 2008